#include"Sort.h"
void TestInsertSort()
{
	int a[] = { 9,8,7,6,5,4,3,2,1,0 };
	InsertSort(a, sizeof(a) / sizeof(int));
	PrintArray(a, sizeof(a) / sizeof(int));
}
void TestBubbleSort()
{
	int a[] = { 11,9,8,7,6,7,4,3,2,1,0,3,10 };
	BubbleSort(a, sizeof(a) / sizeof(int));
	PrintArray(a, sizeof(a) / sizeof(int));
}
void TestSelectSort()
{
	int a[] = { 9,8,7,6,5,4,3,2,1,0 };
	SelectSort(a, sizeof(a) / sizeof(int));
	PrintArray(a, sizeof(a) / sizeof(int));
}
void TestShellSort()
{
	int a[] = { 11,9,8,7,6,5,4,3,2,1,0,10,22};
	ShellSort(a, sizeof(a) / sizeof(int));
	PrintArray(a, sizeof(a) / sizeof(int));
}
void TestQuickSort()
{
	int a[] = { 9,8,7,6,5,4,3,2,1,0 };
	QuickSort(a, 0, sizeof(a) / sizeof(int) - 1);
	PrintArray(a, sizeof(a) / sizeof(int));
}
void TestPartSort1()
{
	int a[] = { 9,8,7,6,5,4,3,2,1,0 };
	QuickSort(a, 0, sizeof(a) / sizeof(int) - 1);
	PrintArray(a, sizeof(a) / sizeof(int));
}
void TestMergeSort()
{
	int a[] = { 9,8,7,6,5,4,3,2,1,0 };
	MergeSort(a, sizeof(a) / sizeof(int));
	PrintArray(a, sizeof(a) / sizeof(int));
}
// 测试排序的性能对比
//////void TestOP()
//////{
//////	srand(time(0));
//////	const int N = 10000;
//////	int* a1 = (int*)malloc(sizeof(int) * N);
//////	int* a2 = (int*)malloc(sizeof(int) * N);
//////	int* a3 = (int*)malloc(sizeof(int) * N);
//////	int* a4 = (int*)malloc(sizeof(int) * N);
//////	int* a5 = (int*)malloc(sizeof(int) * N);
//////	int* a6 = (int*)malloc(sizeof(int) * N);
//////	int* a7 = (int*)malloc(sizeof(int) * N);
//////
//////	for (int i = 0; i < N; ++i)
//////	{
//////		a1[i] = rand();
//////		a2[i] = a1[i];
//////		a3[i] = a1[i];
//////		a4[i] = a1[i];
//////		a5[i] = a1[i];
//////		a6[i] = a1[i];
//////		a7[i] = a1[i];
//////	}
//////
//////	int begin1 = clock();
//////	InsertSort(a1, N);
//////	int end1 = clock();
//////
//////	int begin2 = clock();
//////	ShellSort(a1, N);
//////	int end2 = clock();
//////
//////	int begin3 = clock();
//////	//SelectSort(a3, N);
//////	int end3 = clock();
//////
//////	int begin4 = clock();
//////	//HeapSort(a1, N);
//////	int end4 = clock();
//////
//////	int begin5 = clock();
//////	//QuickSort(a1, 0, N - 1);
//////	int end5 = clock();
//////
//////	int begin6 = clock();
//////	//MergeSort(a6, N);
//////	int end6 = clock();
//////
//////	int begin7 = clock();
//////	//BubbleSort(a7, N);
//////	int end7 = clock();
//////
//////	printf("InsertSort:%d\n", end1 - begin1);
//////	printf("ShellSort:%d\n", end2 - begin2);
//////	printf("SelectSort:%d\n", end3 - begin3);
//////	printf("HeapSort:%d\n", end4 - begin4);
//////	printf("QuickSort:%d\n", end5 - begin5);
//////	printf("MergeSort:%d\n", end6 - begin6);
//////	printf("BubbleSort:%d\n", end7 - begin7);
//////
//////	free(a1);
//////	free(a2);
//////	free(a3);
//////	free(a4);
//////	free(a5);
//////	free(a6);
//////	free(a7);
//////}
int main()
{
	//TestInsertSort();
	//TestBubbleSort();
	//TestSelectSort();
	//TestShellSort();
	//TestQuickSort();
	TestMergeSort();
	return 0;
}